On Algebraic Immunity and Annihilators
نویسندگان
چکیده
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and AI(f) are inefficient. This work consists of two parts. In the first part, we extend the concept of algebraic immunity. In particular, we argue that a function f may be replaced by another boolean function f called the algebraic complement of f . This motivates us to examineAI(f). We define the extended algebraic immunity of f as AI∗(f) = min{AI(f), AI(fc)}. We prove that 0 ≤ AI(f) − AI∗(f) ≤ 1. Since AI(f) − AI∗(f) = 1 holds for a large number of cases, the difference between AI(f) and AI∗(f) cannot be ignored in algebraic attacks. In the second part, we link boolean functions to hypergraphs so that we can apply known results in hypergraph theory to boolean functions. This not only allows us to find annihilators in a fast and simple way but also provides a good estimation of the upper bound on AI∗(f).
منابع مشابه
A note on linear codes and algebraic immunity of Boolean functions
Since 2003, Algebraic Attacks have received a lot of attention in the cryptography literature. In this context, algebraic immunity quantifies the resistance of a Boolean function to the standard algebraic attack of the pseudo-random generators using it as a nonlinear Boolean function. A high value of algebraic immunity is now an absolutely necessary cryptographic criterion for a resistance to a...
متن کاملOn the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient algorithm for computing the algebraic immunity of a symmetric function. The existence of several symmetric functions with maximum algebraic immunity is proven. In this way, a new class of function which have good implem...
متن کاملNotion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks
It has been noted recently that algebraic (annihilator) immunity alone does not provide sufficient resistance against algebraic attacks. In this regard, given a Boolean function f , just checking the minimum degree annihilators of f, 1 + f is not enough and one should check the relationships of the form fg = h, and a function f , even if it has very good algebraic immunity, is not necessarily g...
متن کاملAlgebraic Attacks and Annihilators
Algebraic attacks on block ciphers and stream ciphers have gained more and more attention in cryptography. Their idea is to express a cipher by a system of equations whose solution reveals the secret key. The complexity of an algebraic attack generally increases with the degree of the equations. Hence, low-degree equations are crucial for the efficiency of algebraic attacks. In the case of simp...
متن کاملAlgebraic Immunity of Boolean Functions Analysis and Construction
In this paper, we first analyse the method of finding algebraic immunity of a Boolean function. Given a Boolean function f on n-variables, we identify a reduced set of homogeneous linear equations by solving which one can decide whether there exist annihilators of f at a specific degree. Moreover, we analyse how an affine transformation on the input variables of f can be exploited to achieve fu...
متن کامل